@InProceedings{RibeiroMaxBenOliFar:2007:MeEfRa,
               author = "Ribeiro, Saulo and Maximo, Andr{\'e} and Bentes, Cristiana and 
                         Oliveira, Ant{\^o}nio and Farias, Ricardo",
          affiliation = "COPPE - Systems Engineering Program, Federal University of Rio de 
                         Janeiro - Brazil and COPPE - Systems Engineering Program, Federal 
                         University of Rio de Janeiro - Brazil and Department of Systems 
                         Engineering, State University of Rio de Janeiro - Brazil and COPPE 
                         - Systems Engineering Program, Federal University of Rio de 
                         Janeiro - Brazil and COPPE - Systems Engineering Program, Federal 
                         University of Rio de Janeiro - Brazil",
                title = "Memory-Aware and Efficient Ray-Casting Algorithm",
            booktitle = "Proceedings...",
                 year = "2007",
               editor = "Falc{\~a}o, Alexandre Xavier and Lopes, H{\'e}lio C{\^o}rtes 
                         Vieira",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 20. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "Scientific Visualization, Large Data Sets, Volumetric Rendering, 
                         Ray-Casting.",
             abstract = "Ray-casting implementations require that the connectivity between 
                         the cells of the dataset to be explicitly computed and kept in 
                         memory. This constitutes a huge obstacle for obtaining real-time 
                         rendering for very large models. In this paper, we address this 
                         problem by introducing a new implementation of the ray-casting 
                         algorithm for irregular datasets. Our implementation optimizes the 
                         memory usage of past implementations by exploring ray coherence. 
                         The idea is to keep in main memory the information of the faces 
                         traversed by the ray cast through every pixel under the projection 
                         of a visible face. Our results show that exploring pixel coherence 
                         reduces considerably the memory usage, while keeping the 
                         performance of our algorithm competitive with the fastest previous 
                         ones.",
  conference-location = "Belo Horizonte, MG, Brazil",
      conference-year = "7-10 Oct. 2007",
                  doi = "10.1109/SIBGRAPI.2007.28",
                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2007.28",
             language = "en",
                  ibi = "6qtX3pFwXQZG2LgkFdY/RmNfC",
                  url = "http://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/RmNfC",
           targetfile = "ribeiro_visiblefaces.pdf",
        urlaccessdate = "2024, May 02"
}